Deterministic tree pushdown automata and monadic tree rewriting systems
نویسندگان
چکیده
منابع مشابه
Monadic Quantifiers Recognized by Deterministic Pushdown Automata
I characterize the class of type 〈1〉 quantifiers (or, equivalently, type 〈1, 1〉 quantifiers satisfying Conservativity and Extension) that are recognized by deterministic pushdown automata in terms of the associated semilinear sets of vectors in N. These semilinear sets are finite unions of linear sets with at most two generators each, which are taken from a common three-element set of the form ...
متن کاملBranching Pushdown Tree Automata
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children of a tree node in possibly different control states but with identical stacks. We propose branching pushdown tree automata (BPTAs) as a solution. In a BPTA, a push-move views its matching pops as an unbounded, unorde...
متن کاملNonlinear Tree Pattern Pushdown Automata
A new kind of an acyclic pushdown automaton for an ordered tree is presented. The nonlinear tree pattern pushdown automaton represents a complete index of the tree for nonlinear tree patterns and accepts all nonlinear tree patterns which match the tree. Given a tree with n nodes, the number of such nonlinear tree patterns is O((2+ v)n), where v is the number of variables in the patterns. We dis...
متن کاملOrdered Tree-Pushdown Systems
We define a new class of pushdown systems where the pushdown is a tree instead of a word. We allow a limited form of lookahead on the pushdown conforming to a certain ordering restriction, and we show that the resulting class enjoys a decidable reachability problem. This follows from a preservation of recognizability result for the backward reachability relation of such systems. As an applicati...
متن کاملLinear Context-Free Rewriting Systems and Deterministic Tree-Walking Transducers
I n t r o d u c t i o n In [9] a comparison was made of the generative capacity of a number of grammar formalisms. Several were found to share a number of characteristics (described below) and the class of such formalisms was called linear context-free rewriting systems. This paper shows how the class of string languages generated by linear context-free rewriting systems relates to a number of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1988
ISSN: 0022-0000
DOI: 10.1016/0022-0000(88)90014-1